Algebraic Aspects of Polynomial Interpolation in Several Variables
نویسندگان
چکیده
This paper summarizes relations between the constructive theory of polynomial ideals and polynomial interpolation in several variables. The main ingredient is a generalization of the algorithm for division with remainder to \quotients" of polynomials and nite sets of polynomi-als. x1. Introduction When compared to the univariate case, polynomial interpolation in several variables turns out to be notoriously troublesome by providing various non-trivial new diiculties. To overcome some of these problems and to gain understanding of polynomial interpolation in several variables, it is necessary to adopt and apply techniques from algebraic geometry, in particular of the constructive theory of polynomial ideals. The main ingredient of this paper will be a concept closely related to the so{called Grr obner bases, which have been introduced by Buchberger 5,6] in 1965 and which are an important tool in all Computer Algebra systems, especially, but not only, for algebraic techniques to solve polynomial systems of equations. The issue to be considered here is a very simple observation in the uni-variate case: let x 0 ; : : : ; x n 2 IR be distinct points and let !(x) = (x ? x 0) (x ? x n) be the polynomial of degree n + 1 with normalized leading coeecient which vanishes in all the points. It is well{known and probably taught in any class on Numerical Analysis that for any f : fx 0 ; : : : ; x n g ! IR there exists a unique interpolation polynomial L x 0 ;:::;x n f of degree n. Moreover, if p is any polynomial, then there is an \algebraic" way to compute the interpolant with Approximation Theory IX ISBN 1-xxxxx-xxx-x. All rights of reproduction in any form reserved.
منابع مشابه
INTERPOLATION BY HYPERBOLIC B-SPLINE FUNCTIONS
In this paper we present a new kind of B-splines, called hyperbolic B-splines generated over the space spanned by hyperbolic functions and we use it to interpolate an arbitrary function on a set of points. Numerical tests for illustrating hyperbolic B-spline are presented.
متن کاملEfficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in O(D) operations, for D ≈ ` n d ́ , rather than in O(D) operations necessary in all p...
متن کاملMEAN VALUE INTERPOLATION ON SPHERES
In this paper we consider multivariate Lagrange mean-value interpolation problem, where interpolation parameters are integrals over spheres. We have concentric spheres. Indeed, we consider the problem in three variables when it is not correct.
متن کاملMultivariate Lagrange Interpolation and an Application of Cayley-Bacharach Theorem For it
In this paper,we deeply research Lagrange interpolation of n-variables and give an application of Cayley-Bacharach theorem for it. We pose the concept of sufficient intersection about s(1 ≤ s ≤ n) algebraic hypersurfaces in n-dimensional complex Euclidean space and discuss the Lagrange interpolation along the algebraic manifold of sufficient intersection. By means of some theorems ( such as Bez...
متن کاملCourse Outline for CS 236610: Recent Advances in Algebraic and Combinatorial Coding Theory
The course will cover several advanced topics in algebraic and combinatorial coding theory. One of the most exciting breakthroughs in algebraic coding theory in the past decade is a new paradigm for decoding Reed-Solomon codes using bivariate (or multivariate) polynomial interpolation. The first half of the course will be devoted to an in-depth study of this subject. The second half of the cour...
متن کامل